An Interpretation of Typed Objects into Typed pi-Calculus
نویسنده
چکیده
An interpretation of Abadi and Cardelli's rst-order functional Object Calculus AC94b] into a typed-calculus is presented. The interpretation validates the subtyping relation and the typing judgements of the Object Calculus, and is computationally adequate. The type language for the-calculus is that in PS93] a development of Milner's sorting discipline Mil91] with I/O annotations to separate the capabilities of reading and writing on a channel but with variants in place of tuples. Types are necessary to justify certain algebraic laws for the-calculus which are important in the proof of computational adequacy of the translation. The study intends to ooer a contribution to understanding, on the one hand, the relationship between-calculus types and conventional types of programming languages and, on the other hand, the usefulness of the-calculus as a metalanguage for the semantics of typed Object-Oriented languages. Une interprrtation des Objets Typs dans le-calcul RRsumm : Nous prrsentons une interprrtation de l'Object Calculus fonctionnel de premier ordre d'Abadi et Cardelli AC94b] en-calcul typ. Cette interprrtation valide le sous-typage et le typage de l'Object Calculus, et est addquat ((computational adequacyy). Le langage des types pour le-calcul est celui ddcrit dans PS93] un ddveloppement de la discipline de sorting de Milner Mil91] avec annotations I/O pour ssparer les capacitts de lire et d''crire sur un canal mais avec des variantes au lieu de tuples. Les types sont nncessaires pour justiier certaines lois alggbriques du-calcul qui sont importantes dans la preuve de correction oprationnelle de la traduction. Cette tude a pour objet de contribuer la comprrhension, d'une part, de la relation entre les types de-calcul et les types conventionnels des langages de programmation et, d'autre part, de l'utilitt du-calcul comme mmtalangage pour la ssmantique des langages objet typs.
منابع مشابه
An Interpretation of Typed Concurrent Objects in the Blue Calculus Draft
We propose an interpretation of a typed concurrent calculus of objects (conc&) based on the model of Abadi and Cardelli's imperative object calculus. The target of our interpretation is a version of the blue calculus, a variant of the-calculus that directly contains the-calculus, with record and rst-order types. We show that reduction and type judgements can be derived in a rather simple and na...
متن کاملAn Interpretation of Typed Concurrent Objects in the Blue Calculus
We propose an interpretation of a typed concurrent calculus of objects based on the imperative object calculus of Abadi and Cardelli. The target of our interpretation is a version of the blue calculus, a variant of the π-calculus that directly contains functions, with record and firstorder types. We show that reductions and type judgments are derivable in a rather simple and natural way, and th...
متن کاملProcess Types as a Descriptive Tool for Interaction - Control and the Pi-Calculus
We demonstrate a tight relationship between linearly typed π-calculi and typed λ-calculi by giving a type-preserving translation from the call-by-value λμ-calculus into a typed π-calculus. The λμ-calculus has a particularly simple representation as typed mobile processes. The target calculus is a simple variant of the linear π-calculus. We establish full abstraction up to maximally consistent o...
متن کاملPict: a programming language based on the Pi-Calculus
The -calculus o ers an attractive basis for concurrent programming. It is small, elegant, and well studied, and supports (via simple encodings) a wide range of high-level constructs including data structures, higher-order functional programming, concurrent control structures, and objects. Moreover, familiar type systems for the -calculus have direct counterparts in the -calculus, yielding stron...
متن کاملProgramming Research Group the -calculus with Type Similarity the -calculus with Type Similarity
Motivated by the problems of the undecidablity of higher-order uniication and hence the unde-cidability of-uniication, Pym and Elliott give a weaker notion of typing for-objects : type similarity. In this paper we present a new calculus giving a formal theory of type similarity that captures this weaker notion of typing. We then apply a variant of Hardin's interpretation method to show that wel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 143 شماره
صفحات -
تاریخ انتشار 1998